package UnitTest.DataStructureTest.arrayAndListTest.arrayApplyTest;

import DataStructure.arrayAndList.arrayApply.FindLongestSequence;
import org.junit.Test;

/**
 * @author liujun
 * @version 1.0
 * @date 2020/5/15
 * @author—Email ljfirst@mail.ustc.edu.cn
 * @blogURL https://blog.csdn.net/ljfirst
 * @description 找出数字连续的最长序列
 * 给定一个未排序的整数数组 nums ，找出数字连续的最长序列（不要求序列元素在原数组中连续）的长度。
 * 请你设计并实现时间复杂度为O(n) 的算法解决此问题
 * 示例 1：
 * 输入：nums = [100,4,200,1,3,2]
 * 输出：4
 * 解释：最长数字连续序列是 [1, 2, 3, 4]。它的长度为 4。
 * 示例 2：
 * 输入：nums = [0,3,7,2,5,8,4,6,0,1]
 * 输出：9
 */

public class FindLongestSequenceTest {

    @Test
    public void TestlongestConsecutive() {
        test(new FindLongestSequence());
    }

    public void test(FindLongestSequence fls) {
        int[] arrays = new int[]{100, 4, 200, 1, 3, 2};
        int answer = fls.longestConsecutive(arrays);
        assert answer == 4;

        arrays = new int[]{0, 3, 7, 2, 5, 8, 4, 12, 11, 6, 0, 1};
        answer = fls.longestConsecutive(arrays);
        assert answer == 9;

        arrays = new int[]{1, 14, 15, 4, 2, 3, 7, 11, 5, 91, 92, 12, 13, 93, 94, 6, 16};
        answer = fls.longestConsecutive(arrays);
        assert answer == 7;

        arrays = new int[]{0, 0};
        answer = fls.longestConsecutive(arrays);
        assert answer == 1;
    }
}
